Intersection Graphs for String Links
نویسنده
چکیده
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graphs, and show that these weight systems are related to the weight systems induced by the Conway and Homfly polynomials.
منابع مشابه
Tree Diagrams for String Links
In previous work [7], the author defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of string link diagrams.
متن کاملAlmost all string graphs are intersection graphs of plane convex sets
A string graph is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of almost all string graphs on n vertices can be partitioned into five cliques such that so...
متن کاملWeakly transitive orientations, Hasse diagrams and string graphs
Middendorf, M. and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs, Discrete Mathematics 111 (1993) 393-400. We introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden substructurs. As a corollary of this characteriz...
متن کاملString graphs and separators
String graphs, that is, intersection graphs of curves in the plane, have been studied since the 1960s. We provide an expository presentation of several results, including very recent ones: some string graphs require an exponential number of crossings in every string representation; exponential number is always sufficient; string graphs have small separators; and the current best bound on the cr...
متن کاملSeparators in Region Intersection Graphs
For undirected graphs G (V, E) and G0 (V0 , E0), say that G is a region intersection graph over G0 if there is a family of connected subsets {Ru ⊆ V0 : u ∈ V} of G0 such that {u , v} ∈ E ⇐⇒ Ru ∩ Rv , ∅. We show if G0 excludes the complete graph Kh as a minor for some h > 1, then every region intersection graph G over G0 with m edges has a balanced separator with at most ch √ m nodes, where ch i...
متن کامل